Deterministic algorithms for compiling quantum circuits with recurrent patterns

Current quantum processors are noisy and have limited coherence imperfect gate implementations. On such hardware, only algorithms that shorter than the overall time can be implemented executed successfully. A good compiler must translate an input program into most efficient equivalent of itself, getting out available hardware. In this work, we present novel deterministic for compiling recurrent circuit patterns in polynomial time. particular, appear circuits used to compute ground-state properties molecular systems using variational eigensolver method together with RyRz heuristic wavefunction Ansätz. We show our pattern-oriented algorithms, combined swapping strategy, produces—in general—output programs comparable those obtained state-of-the-art compilers, terms CNOT count depth. solution produces unmatched results on circuits.